当前位置：
首页 资源下载
搜索资源 - applied cryptography
搜索资源列表
-
0下载：
密码学中的JAVA例子，此源码说明了密码学中的JAVA的应用，借此说明JAVA的广泛应用，已应用到了很广的范围了！-cryptography JAVA example, the source of cryptography note of Java applications, this shows that the extensive application of Java, has been applied to a very wide scope of the!
-
-
0下载：
背包问题(Knapsack problem)是一种组合优化的NP完全问题, 相似问题经常出现在商业、投资组合优化、组合数学，计算复杂性理论、密码学和应用数学等领域中，因此具有广泛的实际应用领域。-Knapsack problem (Knapsack problem) is a kind of combinatorial optimization of NP-complete problem, the problem often similar to business, investment po
-
-
0下载：
implementation of MD5 as outlined in "Handbook of Applied Cryptography", pages 346 - 347.
-
-
0下载：
base implementation of MD4 family style digest as outlined in "Handbook of Applied Cryptography", pages 344 - 347.
-
-
0下载：
A book about applied cryptography
-
-
0下载：
implementation of SHA-1 as outlined in "Handbook of Applied Cryptography", pages 346 - 349.
-
-
0下载：
implementation of MD5 as outlined in "Handbook of Applied Cryptography", pages 346 - 347.
-
-
0下载：
Color visual cryptography (VC) encrypts a color secret message into color halftone image shares. Previous methods in the literature show good results for black and white or gray scale VC schemes, however, they are not sufficient to be applied directl
-
-
0下载：
背包问题(Knapsack problem)是一种组合优化的NP完全问题。问题可以描述为：给定一组物品，每种物品都有自己的重量和价格，在限定的总重量内，我们如何选择，才能使得物品的总价格最高。问题的名称来源于如何选择最合适的物品放置于给定背包中。相似问题经常出现在商业、组合数学，计算复杂性理论、密码学和应用数学等领域中。也可以将背包问题描述为决定性问题，即在总重量不超过W的前提下，总价值是否能达到V？它是在1978年由Merkel和Hellman提出的。-Knapsack problem (Kn
-
-
0下载：
Algorithm Knapsacks code
The knapsack problem or rucksack problem is a problem in combinatorial optimization: Given a set of items, each with a mass and a value, determine the number of each item to include in a collection so that the total weig
-
